<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/sort_algorithms/merge_sort/mergesort_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('mergesort__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">mergesort_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="mergesort__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef MERGESORTER_TEST_H</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define MERGESORTER_TEST_H</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="mergesort_8h.html">mergesort.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">IntroductionToAlgorithm::SortAlgorithm::merge</a>;</div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">IntroductionToAlgorithm::SortAlgorithm::merge_sort</a>;</div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;</div>
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="mergesort__test_8h.html#aaa0692399fb3f538feb04053f36a2978">   31</a></span>&#160;<a class="code" href="mergesort__test_8h.html#aaa0692399fb3f538feb04053f36a2978">TEST</a>(test_merge_sort, test_C_array)</div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;{</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;    <span class="keywordtype">int</span> data1[10]={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <span class="keywordtype">int</span> data2[10]={10,9,8,7,6,5,4,3,2,1};</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;    <span class="keywordtype">int</span> data3[10]={5,5,5,5,5,4,4,4,4,4};</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;    <span class="keywordtype">int</span> data4[1]={5};</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;    <span class="keywordtype">int</span> comparedata1[10]={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;    <span class="keywordtype">int</span> comparedata2[10]={10,9,8,7,6,5,4,3,2,1};</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;    <span class="keywordtype">int</span> comparedata3[10]={5,5,5,5,5,4,4,4,4,4};</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;    <span class="keywordtype">int</span> comparedata4[1]={5};</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;    std::sort(comparedata1,comparedata1+10);</div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">merge_sort</a>(data1+0,data1+10);</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;    std::sort(comparedata2,comparedata2+10);</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">merge_sort</a>(data2+0,data2+10);</div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    std::sort(comparedata3,comparedata3+10);</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">merge_sort</a>(data3+0,data3+10);</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    std::sort(comparedata4,comparedata4+1);</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">merge_sort</a>(data4+0,data4+1);</div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data1,data1+10),std::vector&lt;int&gt;(comparedata1,comparedata1+10));</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data2,data2+10),std::vector&lt;int&gt;(comparedata2,comparedata2+10));</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data3,data3+10),std::vector&lt;int&gt;(comparedata3,comparedata3+10));</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data4,data4+1),std::vector&lt;int&gt;(comparedata4,comparedata4+1));</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;}</div>
<div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;</div>
<div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;</div>
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="mergesort__test_8h.html#a3ba4120b2fc820c85807a87fa724b4c8">   62</a></span>&#160;<a class="code" href="mergesort__test_8h.html#aaa0692399fb3f538feb04053f36a2978">TEST</a>(test_merge_sort, test_std_container)</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;{</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;    std::vector&lt;int&gt; data1={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;    std::vector&lt;int&gt; data2={10,9,8,7,6,5,4,3,2,1};</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;    std::vector&lt;int&gt; data3={5,5,5,5,5,4,4,4,4,4};</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;    std::vector&lt;int&gt; data4={5};</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;    std::vector&lt;int&gt; comparedata1={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;    std::vector&lt;int&gt; comparedata2={10,9,8,7,6,5,4,3,2,1};</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;    std::vector&lt;int&gt; comparedata3={5,5,5,5,5,4,4,4,4,4};</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    std::vector&lt;int&gt; comparedata4={5};</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;    std::sort(comparedata1.begin(),comparedata1.end());</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">merge_sort</a>(data1.begin(),data1.end());</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;    std::sort(comparedata2.begin(),comparedata2.end());</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">merge_sort</a>(data2.begin(),data2.end());</div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;    std::sort(comparedata3.begin(),comparedata3.end());</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">merge_sort</a>(data3.begin(),data3.end());</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    std::sort(comparedata4.begin(),comparedata4.end());</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">merge_sort</a>(data4.begin(),data4.end());</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    EXPECT_EQ(data1,comparedata1);</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;    EXPECT_EQ(data2,comparedata2);</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    EXPECT_EQ(data3,comparedata3);</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;    EXPECT_EQ(data4,comparedata4);</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;}</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;</div>
<div class="line"><a name="l00092"></a><span class="lineno"><a class="line" href="mergesort__test_8h.html#a624f7bd45f730204baf874014d774e02">   92</a></span>&#160;<a class="code" href="mergesort__test_8h.html#aaa0692399fb3f538feb04053f36a2978">TEST</a>(test_merge, test_C_array)</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;{</div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    <span class="keywordtype">int</span> data1[10]={1,3,5,7,9,2,4,6,8,10};</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    <span class="keywordtype">int</span> data2[10]={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;    <span class="keywordtype">int</span> data3[10]={1,2,3,4,5,6,7,8,9,0};</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;    <span class="keywordtype">int</span> data4[10]={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;    <span class="keywordtype">int</span> data5[10]={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;    <span class="keywordtype">int</span> comparedata1[10]={1,3,5,7,9,2,4,6,8,10};</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    <span class="keywordtype">int</span> comparedata2[10]={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;    <span class="keywordtype">int</span> comparedata3[10]={1,2,3,4,5,6,7,8,9,0};</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;    <span class="keywordtype">int</span> comparedata4[10]={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;    <span class="keywordtype">int</span> comparedata5[10]={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    std::sort(comparedata1,comparedata1+10);</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data1+0,data1+10,data1+5);</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    std::sort(comparedata2,comparedata2+10);</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data2+0,data2+10,data2+1);</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;    std::sort(comparedata3,comparedata3+10);</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data3+0,data3+10,data3+9);</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;    std::sort(comparedata4,comparedata4+10);</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data4+0,data4+10,data4+0);</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    std::sort(comparedata5,comparedata5+10);</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data5+0,data5+10,data5+10);</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data1,data1+10),std::vector&lt;int&gt;(comparedata1,comparedata1+10));</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data2,data2+10),std::vector&lt;int&gt;(comparedata2,comparedata2+10));</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data3,data3+10),std::vector&lt;int&gt;(comparedata3,comparedata3+10));</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data4,data4+10),std::vector&lt;int&gt;(comparedata4,comparedata4+10));</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    EXPECT_EQ(std::vector&lt;int&gt;(data5,data5+10),std::vector&lt;int&gt;(comparedata5,comparedata5+10));</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;}</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;</div>
<div class="line"><a name="l00128"></a><span class="lineno"><a class="line" href="mergesort__test_8h.html#a5806959cff92a4e6c979d4fa47902325">  128</a></span>&#160;<a class="code" href="mergesort__test_8h.html#aaa0692399fb3f538feb04053f36a2978">TEST</a>(test_merge, test_std_container)</div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;{</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    std::vector&lt;int&gt; data1={1,3,5,7,9,2,4,6,8,10};</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;    std::vector&lt;int&gt; data2={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;    std::vector&lt;int&gt; data3={1,2,3,4,5,6,7,8,9,0};</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    std::vector&lt;int&gt; data4={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    std::vector&lt;int&gt; data5={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;    std::vector&lt;int&gt; comparedata1={1,3,5,7,9,2,4,6,8,10};</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    std::vector&lt;int&gt; comparedata2={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    std::vector&lt;int&gt; comparedata3={1,2,3,4,5,6,7,8,9,0};</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;    std::vector&lt;int&gt; comparedata4={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;    std::vector&lt;int&gt; comparedata5={1,2,3,4,5,6,7,8,9,10};</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;    std::sort(comparedata1.begin(),comparedata1.end());</div>
<div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data1.begin(),data1.end(),data1.begin()+5);</div>
<div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;    std::sort(comparedata2.begin(),comparedata2.end());</div>
<div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data2.begin(),data2.end(),data2.begin()+1);</div>
<div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;    std::sort(comparedata3.begin(),comparedata3.end());</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data3.begin(),data3.end(),data3.begin()+9);</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;    std::sort(comparedata4.begin(),comparedata4.end());</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data4.begin(),data4.end(),data4.begin()+0);</div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;    std::sort(comparedata5.begin(),comparedata5.end());</div>
<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;    <a class="code" href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">merge</a>(data5.begin(),data5.end(),data5.begin()+10);</div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;    EXPECT_EQ(data1,comparedata1);</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;    EXPECT_EQ(data2,comparedata2);</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;    EXPECT_EQ(data3,comparedata3);</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;    EXPECT_EQ(data4,comparedata4);</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;    EXPECT_EQ(data5,comparedata5);</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;}</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;<span class="preprocessor">#endif // MERGESORTER_TEST_H</span></div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;</div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_sort_algorithm_html_a4806cf41bd25ff1d1344d858a7a5b577"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a4806cf41bd25ff1d1344d858a7a5b577">IntroductionToAlgorithm::SortAlgorithm::merge</a></div><div class="ttdeci">void merge(const Iterator begin, const Iterator end, const Iterator middle, CompareType compare=CompareType())</div><div class="ttdoc">merge：算法导论第二章 2.3.1 </div><div class="ttdef"><b>Definition:</b> <a href="mergesort_8h_source.html#l00042">mergesort.h:42</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_sort_algorithm_html_a38dce6f6996c858aef1096d75bb785db"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_sort_algorithm.html#a38dce6f6996c858aef1096d75bb785db">IntroductionToAlgorithm::SortAlgorithm::merge_sort</a></div><div class="ttdeci">void merge_sort(const Iterator begin, const Iterator end, CompareType compare=CompareType())</div><div class="ttdoc">merge_sort：算法导论第二章 2.3.1 </div><div class="ttdef"><b>Definition:</b> <a href="mergesort_8h_source.html#l00086">mergesort.h:86</a></div></div>
<div class="ttc" id="mergesort__test_8h_html_aaa0692399fb3f538feb04053f36a2978"><div class="ttname"><a href="mergesort__test_8h.html#aaa0692399fb3f538feb04053f36a2978">TEST</a></div><div class="ttdeci">TEST(test_merge_sort, test_C_array)</div><div class="ttdoc">merge_sort_test：测试C数组的归并排序 </div><div class="ttdef"><b>Definition:</b> <a href="mergesort__test_8h_source.html#l00031">mergesort_test.h:31</a></div></div>
<div class="ttc" id="mergesort_8h_html"><div class="ttname"><a href="mergesort_8h.html">mergesort.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_a03788f144befb43ca5cf4ac95d7a30a.html">sort_algorithms</a></li><li class="navelem"><a class="el" href="dir_be564627efc24d1cbd2e8fddae3c34cc.html">merge_sort</a></li><li class="navelem"><a class="el" href="mergesort__test_8h.html">mergesort_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
